Beta-conjugates of Real Algebraic Numbers as Puiseux Expansions
نویسنده
چکیده
The beta-conjugates of a base of numeration β > 1, β being a Parry number, were introduced by Boyd, in the context of the Rényi-Parry dynamics of numeration system and the beta-transformation. These beta-conjugates are canonically associated with β. Let β > 1 be a real algebraic number. A more general definition of the beta-conjugates of β is introduced in terms of the Parry Upper function fβ(z) of the beta-transformation. We introduce the concept of a germ of curve at (0, 1/β) ∈ C2 associated with fβ(z) and the reciprocal of the minimal polynomial of β. This germ is decomposed into irreducible elements according to the theory of Puiseux, gathered into conjugacy classes. The beta-conjugates of β, in terms of the Puiseux expansions, are given a new equivalent definition in this new context. If β is a Parry number the (Artin-Mazur) dynamical zeta function ζβ(z) of the beta-transformation, simply related to fβ(z), is expressed as a product formula, under some assumptions, a sort of analog to the Euler product of the Riemann zeta function, and the factorization of the Parry polynomial of β is deduced from the germ.
منابع مشابه
Dynamic Newton–Puiseux Theorem
A constructive version of Newton–Puiseux theorem for computing the Puiseux expansions of algebraic curves is presented. The proof is based on a classical proof by Abhyankar. Algebraic numbers are evaluated dynamically; hence the base field need not be algebraically closed and a factorization algorithm of polynomials over the base field is not needed. The extensions obtained are a type of regula...
متن کاملDynamic Newton–Puiseux Theorem
A constructive version of Newton–Puiseux theorem for computing the Puiseux expansions of algebraic curves is presented. The proof is based on a classical proof by Abhyankar. Algebraic numbers are evaluated dynamically; hence the base field need not be algebraically closed and a factorization algorithm of polynomials over the base field is not needed. The extensions obtained are a type of regula...
متن کاملDynamic Newton-Puiseux theorem
A constructive version of Newton-Puiseux theorem for computing the Puiseux expansion of algebraic curves is presented. The proof is based on a classical proof by Abhyankar. Algebraic numbers are evaluated dynamically; hence the base field need not be algebraically closed and a factorization algorithm of polynomials over the base field is not needed. The extensions obtained are a type of regular...
متن کاملA polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function
In this paper we present a refined version of the Newton polygon process to compute the Puiseux expansions of an algebraic function defined over the rational function field. We determine an upper bound for the bitcomplexity of computing the singular part of a Puiseux expansion by this algorithm, and use a recent quantitative version of Eisenstein’s theorem on power series expansions of algebrai...
متن کاملOn the dichotomy of Perron numbers and beta-conjugates
Let β > 1 be an algebraic number. A general definition of a beta-conjugate of β is proposed with respect to the analytical function fβ(z) = −1 + ∑ i≥1 tiz i associated with the Rényi β-expansion dβ(1) = 0.t1t2 . . . of unity. From Szegö’s Theorem, we study the dichotomy problem for fβ(z), in particular for β a Perron number: whether it is a rational fraction or admits the unit circle as natural...
متن کامل